Combinatorial proofs of generating function identities for F-partitions
نویسندگان
چکیده
منابع مشابه
Combinatorial proofs of generating function identities for F-partitions
In his memoir in 1984, George E. Andrews introduces many general classes of Frobenius partitions (simply F-partitions). Especially, he focuses his interest on two general classes of F-partitions: one is F-partitions that allow up to k repetitions of an integer in any row, and the other is F-partitions whose parts are taken from k copies of the nonnegative integers. The latter are called k color...
متن کاملCombinatorial Proofs of Hook Generating Functions for Skew Plane Partitions
Sagan, B.E., Combinatorial proofs of hook generating functions for skew plane partitions, Theoretical Computer Science 117 (1993) 273-287. We provide combinatorial proofs of two hook generating functions for skew plane partitions. One proof involves the Hillman-Grass1 (1976) algorithm and the other uses a modification of Schiitzenberger’s (1963, 1977) “jeu de taquin” due to Kadell (to appear). ...
متن کاملCombinatorial Proofs of Identities Involving Symmetric Matrices
Brualdi and Ma found a connection between involutions of length n with k descents and symmetric k×k matrices with non-negative integer entries summing to n and having no row or column of zeros. From their main theorem they derived two alternating sums by algebraic means and asked for combinatorial proofs. The purpose of this note is to give such demonstrations.
متن کاملCombinatorial Proofs of q-Series Identities
We provide combinatorial proofs of six of the ten q-series identities listed in [3, Theorem 3]. Andrews, Jiménez-Urroz and Ono prove these identities using formal manipulation of identities arising in the theory of basic hypergeometric series. Our proofs are purely combinatorial, based on interpreting both sides of the identities as generating functions for certain partitions. One of these iden...
متن کاملCombinatorial and Automated Proofs of Certain Identities
This paper focuses on two binomial identities. The proofs illustrate the power and elegance in enumerative/algebraic combinatorial arguments, modern machineassisted techniques of Wilf-Zeilberger and the classical tools of generatingfunctionology.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2003
ISSN: 0097-3165
DOI: 10.1016/s0097-3165(03)00023-2